A Characterization of Box-Mengerian Matroid Ports

نویسندگان

  • Xujin Chen
  • Guoli Ding
  • Wenan Zang
چکیده

Let M be a matroid on E ∪ {`}, where ` 6∈ E is a distinguished element of M . The `-port of M is the set P = {P : P ⊆ E with P ∪ {`} a circuit of M}. Let A be the P-E incidence matrix. Let U2,4 be the uniform matroid on four elements of rank two, F7 be the Fano matroid, F ∗ 7 be the dual of F7, and F 7 be the unique series extension of F7. In this paper, we prove that the system Ax ≥ 1, x ≥ 0 is box-totally dual integral (box-TDI) if and only if M has no U2,4-minor using `, no F ∗ 7 -minor using `, and no F 7 -minor using ` as a series element. Our characterization yields a number of interesting results in combinatorial optimization. MSC 2000 subject classification. Primary: 90C10, 90C27, 90C57. OR/MS subject classification. Primary: Programming/graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Unified Approach to Box-Mengerian Hypergraphs

LetH = (V, E) be a hypergraph and let A be the E−V incidence matrix. We callH box-Mengerian if the linear system Ax ≥ 1, x ≥ 0 is box-totally dual integral (box-TDI). As it is NP -hard in general to recognize box-Mengerian hypergraphs, a basic theme in combinatorial optimization is to identify such objects associated with various problems. In this paper we show that the so-called ESP (equitable...

متن کامل

On Secret Sharing Schemes, Matroids and Polymatroids

The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem in secret sharing. We explore in this paper the connections of this open problem with matroids and polymatroids. Matroid ports were introduced by L...

متن کامل

Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants

One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. Brickell and Davenport proved that every one of these ideal access structures is related in a certain way to a unique matroid. Specifically, they are matroid ports. In addition to the search of general results, this difficult open problem has been studied in previous...

متن کامل

On the Diameter of Matroid Ports

A clutter or antichain on a set defines a hypergraph. Matroid ports are a special class of clutters, and this paper deals with the diameter of matroid ports, that is, the diameter of the corresponding hypergraphs. Specifically, we prove that the diameter of every matroid port is at most 2. The main interest of our result is its application to secret sharing. Brickell and Davenport proved in 198...

متن کامل

CHARACTERIZATION OF L-FUZZIFYING MATROIDS BY L-FUZZIFYING CLOSURE OPERATORS

An L-fuzzifying matroid is a pair (E, I), where I is a map from2E to L satisfying three axioms. In this paper, the notion of closure operatorsin matroid theory is generalized to an L-fuzzy setting and called L-fuzzifyingclosure operators. It is proved that there exists a one-to-one correspondencebetween L-fuzzifying matroids and their L-fuzzifying closure operators.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2008